An Algorithm to find a Minimum Feedback Vertex Set of an Interval Graph
نویسندگان
چکیده
In an undirected graph, the feedback vertex set problem is to find a set of vertices of minimum cardinality whose removal makes the graph acyclic (connected or disconnected). This problem is known to be NP-hard for general graph. In this paper, we proposed two algorithms for finding the minimum feedback vertex set on interval graphs. The first algorithm is for unweighted case and takes O(n + m) time while the second one is for weighted case taking O(n √ logC) time where n is the number of vertices, m is the number of edges and C is the cost of the longest path of the graph.
منابع مشابه
An Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملEternal m- Security Subdivision Numbers in Graphs
Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and any sequence of vertices, there exists a sequence of guards with and either or and is a dominating set. If we take a guard on every ver...
متن کاملMinimum feedback vertex sets in circle graphs
We describe a polynomial time algorithm to find a minimum feedback vertex set, or equivalently, a maximum induced forest, in a circle graph. The circle graphs are the overlap graphs of intervals on a line.
متن کاملA Minimum Feedback Vertex Set in the Trivalent Cayley Graph
Let G = (V(G), E(G)) be a finite and undirected simple graph. A feedback vertex set F of G is a subset of V(G) such that the induced subgraph 〈V(G) − F〉 has no cycle. The minimum feedback vertex set problem is to find a feedback vertex set of minimum cardinality in G. The feedback vertex set problem has been extensively studied in [2], [4], [5], [7]. It is NP-hard for general graphs [6]. The be...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005